Multi-Parent's Niche: n-ary Crossovers on NK-Landscapes

On $n$-ary Hypergroups and Fuzzy $n$-ary Homomorphism

Application of fundamental relations on n-ary polygroups

The class of  $n$-ary polygroups is a certain subclass of $n$-ary hypergroups, a generalization of D{"o}rnte $n$-arygroups and  a generalization of polygroups. The$beta^*$-relation and the $gamma^*$-relation are the smallestequivalence relations on an $n$-ary polygroup $P$ such that$P/beta^*$ and $P/gamma^*$ are an $n$-ary group and acommutative $n$-ary group, respectively. We use the $beta^*$-...

A Walsh Analysis of NK-Landscapes

We use Walsh analysis to show NK-Landscapes form an extremely restricted set of functions out of the set of N bit functions that have interactions between K+1 or fewer bits. Several upper bounds on the extent of the coverage by NK-Landscapes are created based on theory developed in the paper.

Bayes-optimal Hierarchical Classification over Asymmetric Tree-Distance Loss

Hierarchical classification is supervised multi-class classification problem over the set of class labels organized according to a hierarchy. In this report, we study the work by Ramaswamy et. al. on hierarchical classification over symmetric tree distance loss. We extend the consistency of hierarchical classification algorithm over asymmetric tree distance loss. We design a $\mathcal{O}(nk\log...

Genetic Algorithms on NK-Landscapes: Effects of Selection, Drift, Mutation, and Recombination

NK-Landscapes are stochastically generated fitness functions on bit strings, parameterized with N bits and K epistatic interactions between bits. The term epistasis describes nonlinearities in fitness functions due to changes in the values of interacting bits. Empirical studies have shown that the overall performance of random bit climbers on NK-Landscapes is superior to the performance of some...